package leetCode.Test1;

/**
 * @author zwei
 * @create 2024-08-09 20:32
 */
public class longestCommonPrefix {
    public static void main(String[] args) {
        String[] strs={"flower","flow","flight"};
        String result=longestCommonPrefix(strs);
        System.out.println(result);
    }
    //编写一个函数来查找字符串数组中的最长公共前缀。
    //如果不存在公共前缀，返回空字符串 ""。
    public static String longestCommonPrefix(String[] strs) {
        if (strs.length == 0){
            return "";
        }
        int length=strs[0].length();
        int count=strs.length;
        for (int i=0;i<length;i++){
            char c=strs[0].charAt(i);
            for (int j=1;j<count;j++){
                if (i==strs[j].length()||strs[j].charAt(i)!=c){
                    return strs[0].substring(0,i);
                }
            }
        }
        return strs[0];
    }
}
